Competitive FIB Aggregation for Independent Prefixes: Online Ski Rental on the Trie
نویسندگان
چکیده
This paper presents an asymptotically optimal online algorithm for compressing the Forwarding Information Base (FIB) of a router under a stream of updates (namely insert rule, delete rule, and change port of prefix). The objective of the algorithm is to dynamically aggregate forwarding rules into a smaller but equivalent set of rules while taking into account FIB update costs. The problem can be regarded as a new variant of ski rental on the FIB trie, and we prove that our deterministic algorithm is 3.603-competitive. Moreover, a lower bound of 1.636 is derived for any online algorithm.
منابع مشابه
Competitive Analysis
The ski rental problem arises from the following scenario. You want to start skiing, but you don’t own any skis. On each day you go skiing, you can either choose to rent skis for cost 1, or you can buy skis for cost s. Since you don’t know when you might get sick of skiing, (or when you might break your leg and be unable to ski again), the number of days d that you will end up skiing is unknown...
متن کاملPrice Fluctuations: To Buy or to Rent
We extend the classic online ski rental problem, so that the rental price may change over time. We consider several models which differ in the knowledge given to the algorithm: whereas the price development is unknown, an algorithm may have full, partial or no knowledge about the duration of the game. We construct algorithms whose competitive ratios are up to constant or logarithmic factors opt...
متن کاملDynamic TCP Acknowledgment and Other Stories about e / ( e − 1 ) 1
We present the first optimal randomized online algorithms for the TCP acknowledgment problem [3] and the Bahncard problem [5]. These problems are well known to be generalizations of the classical online ski-rental problem, however, they appeared to be harder. In this paper we demonstrate that a number of online algorithms which have optimal competitive ratios of e/(e − 1), including these, are ...
متن کاملThe Semi-stochastic Ski-rental Problem
In this paper, we introduce the semi-stochastic model for dealing with input uncertainty in optimization problems. This model is a hybrid between the overly pessimistic online model and the highly optimistic stochastic (or Bayesian) model. In this model, the algorithm can obtain only limited stochastic information about the future (i.e. about the input distribution)—as the amount of stochastic ...
متن کاملOn the Best Possible Competitive Ratio for Multislope Ski Rental
The multislope ski-rental problem [LPSR08a] is an extension of the classical ski-rental problem [KMRS88], where the player has several lease options in addition to the pure rent and buy options. In this problem an instance, which is the setting of the options, significantly affects the player’s performance. There is an algorithm that for a given instance, computes the best possible strategy [AI...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013